On Components of Preparata Codes
نویسنده
چکیده
The paper considers the interrelation between i-components of an arbitrary Preparata-like code P and i-components of a perfect code C containing P . It is shown that each i-component of P can uniquely be completed to an i-component of C by adding a certain number of special codewords of C. It is shown that the set of vertices of P in a characteristic graph of an arbitrary i-component of C forms a perfect code with distance 3.
منابع مشابه
The Preparata and Goethals codes: Trellis complexity and twisted squaring constructions
The trellis complexity of the Preparata and Goethals codes is examined. It is shown that at least for a given set of permutations these codes are rectangular. Upper bounds on the state complexity profiles of the Preparata and Goethals codes are given. The upper bounds on the state complexity of the Preparata and Goethals codes are determined by the DLP of the extended primitive doubleand triple...
متن کاملOn the minimum distance graph of an extended Preparata code
The minimum distance graph of an extended Preparata code P (m) has vertices corresponding to codewords and edges corresponding to pairs of codewords that are distance 6 apart. The clique structure of this graph is investigated and it is established that the minimum distance graphs of two extended Preparata codes are isomorphic if and only if the codes are equivalent.
متن کاملOn the Preparata-like codes
A class of Preparata-like group codes is considered. It was suggested by Baker, van Lint and Wilson and re-stated in a different form by Ericson. We show that all such codes are inside the Hamming code providing its partition into the cosets of the Preparata-like codes. This partition induces 2-resolvable Steiner quadruple systems.
متن کاملTranslates of Linear Codes Over
We give a method to compute the complete weight distribution of translates of linear codes over Z4. The method follows known ideas that have already been used successfully by others for Hamming weight distributions. For the particular case of quaternary Preparata codes, we obtain that the number of distinct complete weights for the dual Preparata codes and the number of distinct complete coset ...
متن کاملOn weak isometries of Preparata codes
Let C1 and C2 be codes with code distance d. Codes C1 and C2 are called weakly isometric, if there exists a mapping J : C1 → C2, such that for any x, y from C1 the equality d(x, y) = d holds if and only if d(J(x), J(y)) = d. Obviously two codes are weakly isometric if and only if the minimal distance graphs of these codes are isomorphic. In this paper we prove that Preparata code of length n ≥ ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Probl. Inf. Transm.
دوره 40 شماره
صفحات -
تاریخ انتشار 2004